Efficient Calculation of the Reed-muller Form by Means of the Walsh Transform
نویسنده
چکیده
The paper describes a spectral method for combinational logic synthesis using the Walsh transform and the Reed-Muller form. A new algorithm is presented that allows us to obtain the mixed polarity Reed-Muller expansion of Boolean functions. The most popular minimisation (sub-minimisation) criterion of the Reed-Muller form is obtained by the exhaustive search of all the polarity vectors. This paper presents a non-exhaustive method for Reed-Muller expansions. The new method allows us to build the Reed-Muller form based on the analysis of Walsh-Hadamard coefficients. The presented method has much less complexity than the procedures which have been applied until now. Both the transforms and the presented Walsh-Hadamard spectral characterization of the Reed-Muller expansion are compared. An analysis of the properties of the spectra obtained from these transforms is made.
منابع مشابه
On the Calculation of Generalized Reed-muller Canonical Expansions from Disjoint Cube Representation of Boolean Functions
A new algorithm is shown that converts disjoint cube representation of Boolean functions into fixed-polarity Generalized Reed-Muller Expansions (GRME). Since the known fast algorithm Ihal generates the GRME based on the factorization or thc Reed-Muller transform matrix always starts from the truth table (minterms) of Boolean function, then the described method has the advantages due to smaller ...
متن کاملApplications of Multi-Terminal Binary Decision Diagrams
Functions that map boolean vectors into the integers are important for the design and verification of arithmetic circuits. MTBDDs and BMDs have been proposed for representing this class of functions. We discuss the relationship between these methods and describe a generalization called hybrid decision diagrams which is often much more concise. The Walsh transform and Reed-Muller transform have ...
متن کاملDirect Reed-Muller Transform of Digital Logic Netlists
A method for computing the Reed-Muller spectrum of a digital logic circuit based on the circuit topology is developed. The technique is based on the definition and use of a transfer matrix to characterize the circuit of interest. The transfer matrix is computed through the use of the structure of the circuit and the transfer matrices of the individual logic gates. The resulting transfer matrix ...
متن کاملFast Decoding of the p-Ary First-Order Reed-Muller Codes Based On Jacket Transform
order Reed-Muller code guaranteeing correction of up to •un/4 sin(p-1/2 pƒÎ)•v errors and having complexity proportional to nlogn, where n=pm is the code length and p is an odd prime. This algorithm is an extension in the complex domain of the fast Hadamard transform decoding algorithm applicable to the binary case. key words: p-ary first-order Reed-Muller codes, decoding algorithms, Jacket matrix
متن کاملTransformations amongst the Walsh, Haar, Arithmetic and Reed-Muller Spectral Domains
Direct transformation amongst the Walsh, Haar, Arithmetic and Reed-Muller spectral domains is considered. Matrix based techniques are developed and it is shown that these can be implemented as fast in-place transforms. It is also shown that these transforms can be implemented directly on decision diagram representations.
متن کامل